Robust dimension reduction, fusion frames, and Grassmannian packings
نویسندگان
چکیده
We consider estimating a random vector from its measurements in a fusion frame, in presence of noise and subspace erasures. A fusion frame is a collection of subspaces, for which the sum of the projection operators onto the subspaces is bounded below and above by constant multiples of the identity operator. We first consider the linear minimum mean-squared error (LMMSE) estimation of the random vector of interest from its fusion frame measurements in the presence of additive white noise. Each fusion frame measurement is a vector whose elements are inner products of an orthogonal basis for a fusion frame subspace and the random vector of interest. We derive bounds on the mean-squared error (MSE) and show that the MSE will achieve its lower bound if the fusion frame is tight. We then analyze the robustness of the constructed LMMSE estimator to erasures of the fusion frame subspaces. We limit our erasure analysis to the class of tight fusion frames and assume that all erasures are equally important. Under these assumptions, we prove that tight fusion frames consisting of equi-dimensional subspaces have maximum robustness (in the MSE sense) with respect to erasures of one subspace among all tight fusion frames, and that the optimal subspace dimension depends on signal-to-noise ratio (SNR). We also prove that tight fusion frames consisting of equi-dimensional subspaces with equal pairwise chordal distances are most robust with respect to two and more subspace erasures, among the class of equi-dimensional tight fusion frames. We call such fusion frames equi-distance tight fusion frames. We prove that the squared chordal distance between the subspaces in such fusion frames meets the so-called simplex bound, and thereby establish connections between equidistance tight fusion frames and optimal Grassmannian packings. Finally, we present several examples for the construction of equi-distance tight fusion frames. © 2008 Elsevier Inc. All rights reserved.
منابع مشابه
Grassmannian Frames with Applications to Coding and Communication
For a given class F of uniform frames of fixed redundancy we define a Grassmannian frame as one that minimizes the maximal correlation |〈fk, fl〉| among all frames {fk}k∈I ∈ F . We first analyze finite-dimensional Grassmannian frames. Using links to packings in Grassmannian spaces and antipodal spherical codes we derive bounds on the minimal achievable correlation for Grassmannian frames. These ...
متن کاملFUSION FRAMES IN HILBERT SPACES
Fusion frames are an extension to frames that provide a framework for applications and providing efficient and robust information processing algorithms. In this article we study the erasure of subspaces of a fusion frame.
متن کاملGrassmannian Fusion Frames
Transmitted data may be corrupted by both noise and data loss. Grassmannian frames are in some sense optimal representations of data transmitted over a noisy channel that may lose some of the transmitted coefficients. Fusion frame (or frame of subspaces) theory is a new area that has potential to be applied to problems in such fields as distributed sensing and parallel processing. Grassmannian ...
متن کامل(C; C\')-Controlled g-Fusion Frames in Hilbert Spaces
Controlled frames in Hilbert spaces have been recently introduced by P. Balazs and etc. for improving the numerical efficiency of interactive algorithms for inverting the frame operator. In this paper we develop a theory based on g-fusion frames on Hilbert spaces, which provides exactly the frameworks not only to model new frames on Hilbert spaces but also for deriving robust operators. In part...
متن کاملOptimality beyond the Welch bound: orthoplectic Grassmannian frames as weighted complex projective 2-designs
Despite being pursued with a lot of dedication in frame theory and quantum information theory, maximal equiangular tight frames have only been confirmed to exist for lowest dimensions. This is especially puzzling since maximal sets of mutually unbiased bases, which are also known to be optimal packings but have a slightly larger number of vectors, are known to exist in complex Hilbert spaces of...
متن کامل